On a strange observation in the theory of the dimer problem

This is a contribution to the number theory of the dimer problem. Let An = 2 n · B n (Bn > 0) denote the number of dimer coverings (i.e., perfect matchings) of a 2n×2n square lattice graph. Bn turns out to be an integer. Motivated by a somewhat strange observation (see below), we investigated the residue classes Bn mod 2 . In this paper, we outline a method that, for a fixed integer r, enables these residue classes to be determined. Explicitly, Bn mod 64 is calculated and from the resulting formula the following proposition is deduced: